Fast, accurate evaluation of exact exchange: The occ-RI-K algorithm
نویسندگان
چکیده
منابع مشابه
Fast and Exact Top-k Algorithm for PageRank
In AI and Web communities, many applications utilize PageRank. To obtain high PageRank score nodes, the original approach iteratively computes the PageRank score of each node until convergence by using the whole graph. If the graph is large, this approach is infeasible due to its high computational cost. The goal of this study is to find top-k PageRank score nodes efficiently for a given graph ...
متن کاملFast Implementation of the Exact PNN Algorithm
Straightforward implementation of the exact pairwise nearest neighbor (PNN) takes O(N) time, where N is the number of training vectors. This is rather slow in practical situations. Fortunately much faster implementation can be obtained with rather simple modifications to the basic algorithm. In the present paper we propose a fast O(τN) time implementation of the exact PNN, where τ is shown to b...
متن کاملFast k-means with accurate bounds
We propose a novel accelerated exact k-means algorithm, which performs better than the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3× faster. We also propose a general improvement of existing state-of-the-art accelerated exact k-means algorithms through better estimates of the distance bounds used to reduce the number of distance calculations, and g...
متن کاملFast k-means algorithm clustering
k-means has recently been recognized as one of the best algorithms for clustering unsupervised data. Since k-means depends mainly on distance calculation between all data points and the centers, the time cost will be high when the size of the dataset is large (for example more than 500millions of points). We propose a two stage algorithm to reduce the time cost of distance calculation for huge ...
متن کاملA block exact fast affine projection algorithm
This paper describes a block (affine) projection algorithm that has exactly the same convergence rate as the original sample-by-sample algorithm and smaller computational complexity than the fast affine projection algorithm. This is achieved by 1) introducing a correction term that compensates for the filter output difference between the sample-by-sample projection algorithm and the straightfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 2015
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.4923369